Hybrid Monte Carlo tree search based multi-objective scheduling

نویسندگان

چکیده

Abstract As markets demand targeted products for highly differentiated use cases, the number of variants in production increases, whilst volume per variant decreases. Different product result differences work content on workstation level which cause takt time losses and a poor utilization. In this context, matrix-structured systems with neither temporal nor spacial linkage emerged to reduce effects different entire system. However, require far more complex control. To that end, paper presents scheduling approach. The proposed system considers variable process sequences their allocation workstations order optimize objectives. This contribution Monte Carlo tree search based optimizer combined local as post derive schedules short span enabling reactive scheduling. application scheduler benchmark problem an industrial demonstrates quality results illustrates how reassigns dynamically.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Multi-objective Monte-Carlo Tree Search

Concerned with multi-objective reinforcement learning (MORL), this paper presents MOMCTS, an extension of Monte-Carlo Tree Search to multi-objective sequential decision making. The known multi-objective indicator referred to as hyper-volume indicator is used to define an action selection criterion, replacing the UCB criterion in order to deal with multi-dimensional rewards. MO-MCTS is firstly c...

متن کامل

Monte-Carlo Tree Search

representation of the game. It was programmed in LISP. Further use of abstraction was also studied by Friedenbach (1980). The combination of search, heuristics, and expert systems led to the best programs in the eighties. At the end of the eighties a new type of Go programs emerged. These programs made an intensive use of pattern recognition. This approach was discussed in detail by Boon (1990)...

متن کامل

Parallel Monte-Carlo Tree Search

Monte-Carlo Tree Search (MCTS) is a new best-first search method that started a revolution in the field of Computer Go. Parallelizing MCTS is an important way to increase the strength of any Go program. In this article, we discuss three parallelization methods for MCTS: leaf parallelization, root parallelization, and tree parallelization. To be effective tree parallelization requires two techni...

متن کامل

Monte-Carlo Tree Search Solver

Recently, Monte-Carlo Tree Search (MCTS) has advanced the field of computer Go substantially. In this article we investigate the application of MCTS for the game Lines of Action (LOA). A new MCTS variant, called MCTS-Solver, has been designed to play narrow tactical lines better in sudden-death games such as LOA. The variant differs from the traditional MCTS in respect to backpropagation and se...

متن کامل

Monte Carlo Tree Search for Multi-Robot Task Allocation

Multi-robot teams are useful in a variety of task allocation domains such as warehouse automation and surveillance. Robots in such domains perform tasks at given locations and specific times, and are allocated tasks to optimize given team objectives. We propose an efficient, satisficing and centralized Monte Carlo Tree Search based algorithm exploiting branch and bound paradigm to solve the mul...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Production Engineering

سال: 2022

ISSN: ['1863-7353', '0944-6524']

DOI: https://doi.org/10.1007/s11740-022-01152-9